Using Circuit Variables to Accelerate Column Generation in Planar Multicommodity Flows
نویسنده
چکیده
In this work we present a way of accelerating a column generation algorithm for the linear minimum cost multicommodity flow problem. We use a new model that, besides the usual variables corresponding to flows on paths, has a polynomial number of extra variables, corresponding to flows on circuits. Those extra variables are explicitly considered in the restricted master problem, from the beginning of the column generation process. The subproblem remains a set of shortest path problems, one for each commodity. We present computational results for the comparison of this new approach with standard column generation, a bundle method and a general-purpose solver. For the tested instances, there is an effective improvement in computational time of the column generation method when the extended model is used. keywords multicommodity flows, column generation, planar graphs.
منابع مشابه
Column Generation for Linear and Integer Programming
Column generation refers to linear programming (LP) algorithms designed to solve problems in which there are a huge number of variables compared to the number of constraints and the simplex algorithm step of determining whether the current basic solution is optimal or finding a variable to enter the basis is done by solving an optimization problem rather than by enumeration. To the best of my k...
متن کاملUsing Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems
We present a column-generation model and branch-and-price-and-cut algorithm for origin-destination integer multicommodity flow problems. The origin-destination integer multicommodity flow problem is a constrained version of the linear multicommodity flow problem in which flow of a commodity (defined in this case by an origin-destination pair) may use only one path from origin to destination. Br...
متن کاملComparing Branch-and-price Algorithms for the Unsplittable Multicommodity Flow Problem
In this paper we address branch-and-price algorithms for the unsplittable multicommodity flow problem. This problem is defined over a capacitated network in which we intend to route a set of commodities, each one with a given origin, destination and demand, at minimal cost, without exceeding the arc capacities. Furthermore, the flow of each commodity must be routed using a single path. Formulat...
متن کاملScale Multicommodity Capacitated Fixed-Charge Network Design
We present a branch-and-price-and-cut algorithm for solving large-scale instances of the multicommodity capacitated fixed-charge network design problem. The restricted master problem solved at each column generation iteration is obtained directly from the compact arc-based model by considering only a subset of the commodity flow variables. The pricing subproblem corresponds to a Lagrangian rela...
متن کامل